package Class.Method.Recursion;

/**
 * Enjoy programming!!!
 * Time: 2021/11/6 -  21:08
 */
public class MiGong {
    public static void main(String[] args) {
        int[][] map = new int[8][7];
//        System.out.println("=========当前迷宫=========");

        for (int i = 0; i < 7; i++) {
            map[0][i] = 1;
            map[7][i] = 1;
        }
        for (int i = 0; i < 8; i++) {
            map[i][6] = 1;
            map[i][0] = 1;
        }
        for (int i = 2; i < 8; i++) {
            map[i][2] = 1;
        }
        map[4][2] = 0;
//        map[3][1] = 1;
//        map[3][2] = 1;
        T.findway(map, 1, 1);
        System.out.println("=========找的路========");
        for (int[] n : map) {
            for (int e : n)
                System.out.print(e + " ");
            System.out.println();
        }
    }
}

class T {
    public static boolean findway(int[][] map, int i, int j) {
        if (map[3][3] == 2) {
            return true;
        } else {
            if (map[i][j] == 0) {
                map[i][j] = 2;
                if (findway(map, i + 1, j)) {
                    return true;
                } else if (findway(map, i, j + 1)) {
                    return true;
                } else if (findway(map, i - 1, j)) {
                    return true;
                } else if (findway(map, i, j - 1)) {
                    return true;
                } else {
                    map[i][j] = 3;
                    return false;
                }
            } else {
                return false;
            }
        }
    }
}

